In vitro selection for a OneMax DNA evolutionary computation
نویسندگان
چکیده
Aspects of Evolutionary Computation, DNA computing, and in vitro evolution are combined in proposed laboratory procedures. Preliminary experimental results are shown. The traditional test problem for Evolutionary Computation known as the OneMax problem is addressed. The preliminary experimental results indicate successful laboratory \separation by tness" of DNA encoded candidate solutions.
منابع مشابه
A design for DNA computation of the OneMax problem
Elements of evolutionary computation and molecular biology are combined to design a DNA evolutionary computation. The traditional test problem for evolutionary computation, OneMax problem is addressed. The key feature is the physical separation of DNA strands consistent with OneMax \ tness."
متن کاملGenetic Algorithms, Selection Schemes, and the Varying Effects of Noise
This paper analyzes the eeect of noise on diierent selection mechanisms for genetic algorithms. Models for several selection schemes are developed that successfully predict the convergence characteristics of genetic algorithms within noisy environments. The selection schemes mod-eled in this paper include proportionate selection, tournament selection, (,) selection, and linear ranking selection...
متن کاملRigorous Hitting Times for Binary Mutations
In the binary evolutionary optimization framework, two mutation operators are theoretically investigated. For both the standard mutation, in which all bits are ipped independently with the same probability, and the 1-bit-ip mutation, which ips exactly one bit per bitstring, the statistical distribution of the rst hitting times of the target are thoroughly computed (expectation and variance) up ...
متن کاملCan OneMax help optimizing LeadingOnes using the EA+RL method?
There exist optimization problems with the target objective, which is to be optimized, and several extra objectives, which can be helpful in the optimization process. The EA+RL method is designed to control optimization algorithms which solve problems with extra objectives. The method is based on the use of reinforcement learning for adaptive online selection of objectives. In this paper we inv...
متن کاملEye-Tracking Evolutionary Algorithm to minimize user's fatigue in IEC applied to Interactive One-Max problem
In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary Computation. The approach is then applied to the Interactive OneMax optimization problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999